<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Library Evolutionary Algorithms for Clustering (LEAC): graph Namespace Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="leac_logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Library Evolutionary Algorithms for Clustering (LEAC)
   &#160;<span id="projectnumber">Version 1.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#enum-members">Enumerations</a> &#124;
<a href="#func-members">Functions</a>  </div>
  <div class="headertitle">
<div class="title">graph Namespace Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>Algorithms and utilities for graphs.  
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classgraph_1_1_algorithms_d_f_s.html">AlgorithmsDFS</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Depth-first search algorithms.  <a href="classgraph_1_1_algorithms_d_f_s.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html">AlgorithmsDFSAdjMatrix</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Depth-first search algorithms for a matrix of bits.  <a href="classgraph_1_1_algorithms_d_f_s_adj_matrix.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="enum-members"></a>
Enumerations</h2></td></tr>
<tr class="memitem:a3844063f8ced6b7f416ff7b4cfd523c7"><td class="memItemLeft" align="right" valign="top">enum &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7">GraphStateVertex</a> { <a class="el" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0">VERTEXSTATE_WHITE</a> =0, 
<a class="el" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea">VERTEXSTATE_GRAY</a> =1, 
<a class="el" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275">VERTEXSTATE_BLACK</a> =2
 }</td></tr>
<tr class="separator:a3844063f8ced6b7f416ff7b4cfd523c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a075ef41b092e4421e4d890b34b11b399"><td class="memItemLeft" align="right" valign="top">std::map&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>, std::list&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a075ef41b092e4421e4d890b34b11b399">fromPiToGraphMap</a> (const std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &amp;aivectorvertexidx_pi)</td></tr>
<tr class="memdesc:a075ef41b092e4421e4d890b34b11b399"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs a list map graph from PI vertices for a Pi vector.  <a href="#a075ef41b092e4421e4d890b34b11b399">More...</a><br /></td></tr>
<tr class="separator:a075ef41b092e4421e4d890b34b11b399"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab591fce56dc3e3d8a23f517cc4a55190"><td class="memTemplParams" colspan="2">template&lt;typename T_VERTEX_IDX &gt; </td></tr>
<tr class="memitem:ab591fce56dc3e3d8a23f517cc4a55190"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::list&lt; T_VERTEX_IDX &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacegraph.html#ab591fce56dc3e3d8a23f517cc4a55190">fromPiToGraph</a> (const std::vector&lt; T_VERTEX_IDX &gt; &amp;aivectorvertexidx_pi)</td></tr>
<tr class="memdesc:ab591fce56dc3e3d8a23f517cc4a55190"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs a vector list graph from PI vertices for a Pi vector.  <a href="#ab591fce56dc3e3d8a23f517cc4a55190">More...</a><br /></td></tr>
<tr class="separator:ab591fce56dc3e3d8a23f517cc4a55190"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7ee0d63533a6004717575b5e8aec5c7d"><td class="memTemplParams" colspan="2">template&lt;typename T_VERTEX_IDX , typename T_BITSIZE &gt; </td></tr>
<tr class="memitem:a7ee0d63533a6004717575b5e8aec5c7d"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::list&lt; T_VERTEX_IDX &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a7ee0d63533a6004717575b5e8aec5c7d">fromPiToGraph</a> (const std::vector&lt; T_VERTEX_IDX &gt; &amp;aivectorvertexidx_pi, const <a class="el" href="classmat_1_1_bit_array.html">mat::BitArray</a>&lt; T_BITSIZE &gt; &amp;aibitarray_edgeRemains)</td></tr>
<tr class="memdesc:a7ee0d63533a6004717575b5e8aec5c7d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs a vector list graph from PI vertices for a Pi vector.  <a href="#a7ee0d63533a6004717575b5e8aec5c7d">More...</a><br /></td></tr>
<tr class="separator:a7ee0d63533a6004717575b5e8aec5c7d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5f47c42addb98405452bb52f5c6599bc"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classds_1_1_disj_sets.html">ds::DisjSets</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a5f47c42addb98405452bb52f5c6599bc">component</a> (const std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &amp;aivectoruintidx_vertexPi)</td></tr>
<tr class="memdesc:a5f47c42addb98405452bb52f5c6599bc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find connected component of a graph.  <a href="#a5f47c42addb98405452bb52f5c6599bc">More...</a><br /></td></tr>
<tr class="separator:a5f47c42addb98405452bb52f5c6599bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2f98b0ea6d3e2aa3816884cdf0cc2277"><td class="memTemplParams" colspan="2">template&lt;typename T_BITSIZE &gt; </td></tr>
<tr class="memitem:a2f98b0ea6d3e2aa3816884cdf0cc2277"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="classds_1_1_disj_sets.html">ds::DisjSets</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a2f98b0ea6d3e2aa3816884cdf0cc2277">component</a> (const std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &amp;aivectoruintidx_vertexPi, const <a class="el" href="classmat_1_1_bit_array.html">mat::BitArray</a>&lt; T_BITSIZE &gt; &amp;aibitarray_edgeRemains)</td></tr>
<tr class="memdesc:a2f98b0ea6d3e2aa3816884cdf0cc2277"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find connected component of a graph.  <a href="#a2f98b0ea6d3e2aa3816884cdf0cc2277">More...</a><br /></td></tr>
<tr class="separator:a2f98b0ea6d3e2aa3816884cdf0cc2277"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a297cbabf753f01d6b237bec48484798e"><td class="memTemplParams" colspan="2">template&lt;typename T_W &gt; </td></tr>
<tr class="memitem:a297cbabf753f01d6b237bec48484798e"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a297cbabf753f01d6b237bec48484798e">prim</a> (const <a class="el" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang</a>&lt; T_W &gt; &amp;aimatrixtriagt_w, const <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> lui_startVertex=0)</td></tr>
<tr class="memdesc:a297cbabf753f01d6b237bec48484798e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prim’s algorithm.  <a href="#a297cbabf753f01d6b237bec48484798e">More...</a><br /></td></tr>
<tr class="separator:a297cbabf753f01d6b237bec48484798e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1a8c03e25337e6becb8d58b8e57e66fc"><td class="memTemplParams" colspan="2">template&lt;typename T_BITSIZE , typename T_FEATURE , typename T_DIST , typename INPUT_ITERATOR &gt; </td></tr>
<tr class="memitem:a1a8c03e25337e6becb8d58b8e57e66fc"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="classmat_1_1_bit_matrix.html">mat::BitMatrix</a>&lt; T_BITSIZE &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a1a8c03e25337e6becb8d58b8e57e66fc">getAdjacencyMatrix</a> (const T_DIST ait_distAdj, INPUT_ITERATOR aiiterator_instfirst, const INPUT_ITERATOR aiiterator_instlast, <a class="el" href="structdist_1_1_dist.html">dist::Dist</a>&lt; T_DIST, T_FEATURE &gt; &amp;aifunc2p_dist, const T_BITSIZE aii_datatypeBitSize=0)</td></tr>
<tr class="separator:a1a8c03e25337e6becb8d58b8e57e66fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a45090d21efbff1f3bf9c762b9aa8e06d"><td class="memTemplParams" colspan="2">template&lt;typename T_REAL , typename T_FEATURE , typename T_CLUSTERIDX , typename INPUT_ITERATOR &gt; </td></tr>
<tr class="memitem:a45090d21efbff1f3bf9c762b9aa8e06d"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="classpartition_1_1_partition_disj_sets.html">partition::PartitionDisjSets</a>&lt; T_CLUSTERIDX &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="namespacegraph.html#a45090d21efbff1f3bf9c762b9aa8e06d">nearestNeighbor</a> (const T_REAL aitr_parameterU, INPUT_ITERATOR aiiterator_instfirst, const INPUT_ITERATOR aiiterator_instlast, <a class="el" href="structdist_1_1_dist.html">dist::Dist</a>&lt; T_REAL, T_FEATURE &gt; &amp;aifunc2p_dist, const T_CLUSTERIDX aii_datatypeClusterIdx=0)</td></tr>
<tr class="memdesc:a45090d21efbff1f3bf9c762b9aa8e06d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Nearest neighbor <a class="el" href="citelist.html#CITEREF_Tseng:Yang:GAclusteringVarK:CLUSTERING:2001">[38]</a>.  <a href="#a45090d21efbff1f3bf9c762b9aa8e06d">More...</a><br /></td></tr>
<tr class="separator:a45090d21efbff1f3bf9c762b9aa8e06d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Algorithms and utilities for graphs. </p>
<dl class="section version"><dt>Version</dt><dd>1.0 </dd></dl>
<dl class="section date"><dt>Date</dt><dd>2015-2017 </dd></dl>
<dl class="section copyright"><dt>Copyright</dt><dd>GPLv3 license </dd></dl>
</div><h2 class="groupheader">Enumeration Type Documentation</h2>
<a id="a3844063f8ced6b7f416ff7b4cfd523c7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3844063f8ced6b7f416ff7b4cfd523c7">&#9670;&nbsp;</a></span>GraphStateVertex</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">enum <a class="el" href="namespacegraph.html#a3844063f8ced6b7f416ff7b4cfd523c7">graph::GraphStateVertex</a></td>
        </tr>
      </table>
</div><div class="memdoc">
<table class="fieldtable">
<tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><a id="a3844063f8ced6b7f416ff7b4cfd523c7a7d5ddcc8d0fedad8a985c195690b68d0"></a>VERTEXSTATE_WHITE&#160;</td><td class="fielddoc"></td></tr>
<tr><td class="fieldname"><a id="a3844063f8ced6b7f416ff7b4cfd523c7a2b80737a6b806a9860c5e8f8661969ea"></a>VERTEXSTATE_GRAY&#160;</td><td class="fielddoc"></td></tr>
<tr><td class="fieldname"><a id="a3844063f8ced6b7f416ff7b4cfd523c7a53eb6c818a94db326397498156ab8275"></a>VERTEXSTATE_BLACK&#160;</td><td class="fielddoc"></td></tr>
</table>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00043">43</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a5f47c42addb98405452bb52f5c6599bc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5f47c42addb98405452bb52f5c6599bc">&#9670;&nbsp;</a></span>component() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classds_1_1_disj_sets.html">ds::DisjSets</a> graph::component </td>
          <td>(</td>
          <td class="paramtype">const std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &amp;&#160;</td>
          <td class="paramname"><em>aivectoruintidx_vertexPi</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Find connected component of a graph. </p>
<p>A connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other by paths <a class="el" href="citelist.html#CITEREF_Tseng:Yang:GAclusteringVarK:CLUSTERING:2001">[38]</a> </p><dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aivectoruintidx_vertexPi</td><td>a vector of indices Pi </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00467">467</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="disjsets_8hpp_source.html#l00118">ds::DisjSets::find()</a>, <a class="el" href="disjsets_8hpp_source.html#l00135">ds::DisjSets::merge()</a>, <a class="el" href="disjsets_8hpp_source.html#l00152">ds::DisjSets::print()</a>, and <a class="el" href="common_8hpp_source.html#l00025">UINTIDX_NIL</a>.</p>

<p class="reference">Referenced by <a class="el" href="gaclustering__vktreebinary_8hpp_source.html#l00070">eac::gaclustering_vktreebinary()</a>, <a class="el" href="main__gas__clustering_8cpp_source.html#l00198">main()</a>, and <a class="el" href="graph__utils_8hpp_source.html#l00787">nearestNeighbor()</a>.</p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="namespacegraph_a5f47c42addb98405452bb52f5c6599bc_cgraph.svg" width="504" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>

</div>
</div>
<a id="a2f98b0ea6d3e2aa3816884cdf0cc2277"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2f98b0ea6d3e2aa3816884cdf0cc2277">&#9670;&nbsp;</a></span>component() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T_BITSIZE &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classds_1_1_disj_sets.html">ds::DisjSets</a> graph::component </td>
          <td>(</td>
          <td class="paramtype">const std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &amp;&#160;</td>
          <td class="paramname"><em>aivectoruintidx_vertexPi</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="classmat_1_1_bit_array.html">mat::BitArray</a>&lt; T_BITSIZE &gt; &amp;&#160;</td>
          <td class="paramname"><em>aibitarray_edgeRemains</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Find connected component of a graph. </p>
<p>A connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other by paths <a class="el" href="citelist.html#CITEREF_Casillas:etal:GAclusteringVarK:GA:2003">[10]</a> </p><dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aivectoruintidx_vertexPi</td><td>a vector of indices Pi </td></tr>
    <tr><td class="paramname">aibitarray_edgeRemains</td><td>a bit array of edge remains </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00525">525</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="disjsets_8hpp_source.html#l00118">ds::DisjSets::find()</a>, <a class="el" href="bit__container_8hpp_source.html#l00224">ds::BitContainer&lt; T_BITSIZE &gt;::getBit()</a>, <a class="el" href="disjsets_8hpp_source.html#l00135">ds::DisjSets::merge()</a>, <a class="el" href="disjsets_8hpp_source.html#l00152">ds::DisjSets::print()</a>, and <a class="el" href="common_8hpp_source.html#l00025">UINTIDX_NIL</a>.</p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="namespacegraph_a2f98b0ea6d3e2aa3816884cdf0cc2277_cgraph.svg" width="522" height="164"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>

</div>
</div>
<a id="ab591fce56dc3e3d8a23f517cc4a55190"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab591fce56dc3e3d8a23f517cc4a55190">&#9670;&nbsp;</a></span>fromPiToGraph() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T_VERTEX_IDX &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::vector&lt; std::list&lt; T_VERTEX_IDX &gt; &gt; graph::fromPiToGraph </td>
          <td>(</td>
          <td class="paramtype">const std::vector&lt; T_VERTEX_IDX &gt; &amp;&#160;</td>
          <td class="paramname"><em>aivectorvertexidx_pi</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Constructs a vector list graph from PI vertices for a Pi vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aivectorvertexidx_pi</td><td>a vector from index Pi </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00355">355</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="common_8hpp_source.html#l00025">UINTIDX_NIL</a>.</p>

<p class="reference">Referenced by <a class="el" href="gaclustering__vktreebinary_8hpp_source.html#l00070">eac::gaclustering_vktreebinary()</a>, <a class="el" href="main__gas__clustering_8cpp_source.html#l00198">main()</a>, <a class="el" href="graph__utils_8hpp_source.html#l00787">nearestNeighbor()</a>, and <a class="el" href="graph__utils_8hpp_source.html#l00589">prim()</a>.</p>

</div>
</div>
<a id="a7ee0d63533a6004717575b5e8aec5c7d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7ee0d63533a6004717575b5e8aec5c7d">&#9670;&nbsp;</a></span>fromPiToGraph() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T_VERTEX_IDX , typename T_BITSIZE &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::vector&lt; std::list&lt; T_VERTEX_IDX &gt; &gt; graph::fromPiToGraph </td>
          <td>(</td>
          <td class="paramtype">const std::vector&lt; T_VERTEX_IDX &gt; &amp;&#160;</td>
          <td class="paramname"><em>aivectorvertexidx_pi</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="classmat_1_1_bit_array.html">mat::BitArray</a>&lt; T_BITSIZE &gt; &amp;&#160;</td>
          <td class="paramname"><em>aibitarray_edgeRemains</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Constructs a vector list graph from PI vertices for a Pi vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aivectorvertexidx_pi</td><td>a vector from index Pi </td></tr>
    <tr><td class="paramname">aibitarray_edgeRemains</td><td>a bit array of edge remains </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00410">410</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="bit__container_8hpp_source.html#l00224">ds::BitContainer&lt; T_BITSIZE &gt;::getBit()</a>, and <a class="el" href="common_8hpp_source.html#l00025">UINTIDX_NIL</a>.</p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="namespacegraph_a7ee0d63533a6004717575b5e8aec5c7d_cgraph.svg" width="376" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>

</div>
</div>
<a id="a075ef41b092e4421e4d890b34b11b399"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a075ef41b092e4421e4d890b34b11b399">&#9670;&nbsp;</a></span>fromPiToGraphMap()</h2>

<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">std::map&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>, std::list&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &gt; graph::fromPiToGraphMap </td>
          <td>(</td>
          <td class="paramtype">const std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; &amp;&#160;</td>
          <td class="paramname"><em>aivectorvertexidx_pi</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Constructs a list map graph from PI vertices for a Pi vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aivectorvertexidx_pi</td><td>a vector from index Pi </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00289">289</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="common_8hpp_source.html#l00025">UINTIDX_NIL</a>.</p>

</div>
</div>
<a id="a1a8c03e25337e6becb8d58b8e57e66fc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1a8c03e25337e6becb8d58b8e57e66fc">&#9670;&nbsp;</a></span>getAdjacencyMatrix()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T_BITSIZE , typename T_FEATURE , typename T_DIST , typename INPUT_ITERATOR &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classmat_1_1_bit_matrix.html">mat::BitMatrix</a>&lt;T_BITSIZE&gt; graph::getAdjacencyMatrix </td>
          <td>(</td>
          <td class="paramtype">const T_DIST&#160;</td>
          <td class="paramname"><em>ait_distAdj</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">INPUT_ITERATOR&#160;</td>
          <td class="paramname"><em>aiiterator_instfirst</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const INPUT_ITERATOR&#160;</td>
          <td class="paramname"><em>aiiterator_instlast</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="structdist_1_1_dist.html">dist::Dist</a>&lt; T_DIST, T_FEATURE &gt; &amp;&#160;</td>
          <td class="paramname"><em>aifunc2p_dist</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T_BITSIZE&#160;</td>
          <td class="paramname"><em>aii_datatypeBitSize</em> = <code>0</code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00694">694</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="instance_8hpp_source.html#l00145">data::Instance&lt; T_FEATURE &gt;::getNumDimensions()</a>, <a class="el" href="bit__matrix_8hpp_source.html#l00129">mat::BitMatrix&lt; T_BITSIZE &gt;::initialize()</a>, <a class="el" href="bit__matrix_8hpp_source.html#l00385">mat::BitMatrix&lt; T_BITSIZE &gt;::print_listAdj()</a>, and <a class="el" href="bit__matrix_8hpp_source.html#l00170">mat::BitMatrix&lt; T_BITSIZE &gt;::setBit()</a>.</p>

<p class="reference">Referenced by <a class="el" href="graph__utils_8hpp_source.html#l00787">nearestNeighbor()</a>.</p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="namespacegraph_a1a8c03e25337e6becb8d58b8e57e66fc_cgraph.svg" width="100%" height="454"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>

</div>
</div>
<a id="a45090d21efbff1f3bf9c762b9aa8e06d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a45090d21efbff1f3bf9c762b9aa8e06d">&#9670;&nbsp;</a></span>nearestNeighbor()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T_REAL , typename T_FEATURE , typename T_CLUSTERIDX , typename INPUT_ITERATOR &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classpartition_1_1_partition_disj_sets.html">partition::PartitionDisjSets</a>&lt; T_CLUSTERIDX &gt; graph::nearestNeighbor </td>
          <td>(</td>
          <td class="paramtype">const T_REAL&#160;</td>
          <td class="paramname"><em>aitr_parameterU</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">INPUT_ITERATOR&#160;</td>
          <td class="paramname"><em>aiiterator_instfirst</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const INPUT_ITERATOR&#160;</td>
          <td class="paramname"><em>aiiterator_instlast</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="structdist_1_1_dist.html">dist::Dist</a>&lt; T_REAL, T_FEATURE &gt; &amp;&#160;</td>
          <td class="paramname"><em>aifunc2p_dist</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const T_CLUSTERIDX&#160;</td>
          <td class="paramname"><em>aii_datatypeClusterIdx</em> = <code>0</code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Nearest neighbor <a class="el" href="citelist.html#CITEREF_Tseng:Yang:GAclusteringVarK:CLUSTERING:2001">[38]</a>. </p>
<p>Make a grouping of the closest instances according to the <img class="formulaInl" alt="$u$" src="form_32.png"/> parameter. </p><dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aitr_parameterU</td><td>a real number the parameter u </td></tr>
    <tr><td class="paramname">aiiterator_instfirst</td><td>an InputIterator to the initial positions of the sequence of instances </td></tr>
    <tr><td class="paramname">aiiterator_instlast</td><td>an InputIterator to the final positions of the sequence of instances </td></tr>
    <tr><td class="paramname">aifunc2p_dist</td><td>an object of type Dist for example <a class="el" href="structdist_1_1_euclidean.html" title="Euclidean distance.">dist::Euclidean</a> </td></tr>
    <tr><td class="paramname">aii_datatypeClusterIdx</td><td></td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00787">787</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="graph__utils_8hpp_source.html#l00467">component()</a>, <a class="el" href="graph__utils_8hpp_source.html#l00355">fromPiToGraph()</a>, <a class="el" href="graph__utils_8hpp_source.html#l00694">getAdjacencyMatrix()</a>, <a class="el" href="instance_8hpp_source.html#l00145">data::Instance&lt; T_FEATURE &gt;::getNumDimensions()</a>, <a class="el" href="graph__utils_8hpp_source.html#l00254">graph::AlgorithmsDFSAdjMatrix&lt; T_BITSIZE &gt;::getPi()</a>, <a class="el" href="graph__utils_8hpp_source.html#l00207">graph::AlgorithmsDFSAdjMatrix&lt; T_BITSIZE &gt;::resolve()</a>, and <a class="el" href="container__out_8hpp_source.html#l00143">inout::vectorlistprint()</a>.</p>

<p class="reference">Referenced by <a class="el" href="clustering__vksubclusterbinary_8hpp_source.html#l00937">eac::clustering_vksubclusterbinary()</a>.</p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="namespacegraph_a45090d21efbff1f3bf9c762b9aa8e06d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>

</div>
</div>
<a id="a297cbabf753f01d6b237bec48484798e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a297cbabf753f01d6b237bec48484798e">&#9670;&nbsp;</a></span>prim()</h2>

<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T_W &gt; </div>
      <table class="memname">
        <tr>
          <td class="memname">std::vector&lt; <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a> &gt; graph::prim </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang</a>&lt; T_W &gt; &amp;&#160;</td>
          <td class="paramname"><em>aimatrixtriagt_w</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="common_8hpp.html#a3f6c33fb604556cdc425e7aa2289d009">uintidx</a>&#160;</td>
          <td class="paramname"><em>lui_startVertex</em> = <code>0</code>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Prim’s algorithm. </p>
<p>Prim’s algorithm. It is assumed that in the graph for this function all the vertices are connected to everyone, not the graph is required. Used to obtain component </p><dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">aimatrixtriagt_w</td><td>a matrix of distances all the vertices are joined with an edge of weight equal to the distance </td></tr>
    <tr><td class="paramname">lui_startVertex</td><td>a starting vertex </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="graph__utils_8hpp_source.html#l00589">589</a> of file <a class="el" href="graph__utils_8hpp_source.html">graph_utils.hpp</a>.</p>

<p class="reference">References <a class="el" href="graph__utils_8hpp_source.html#l00355">fromPiToGraph()</a>, <a class="el" href="matrix__triangular_8hpp_source.html#l00128">mat::MatrixTriang&lt; T_FEATURE &gt;::getNumRows()</a>, <a class="el" href="common_8hpp_source.html#l00025">UINTIDX_NIL</a>, and <a class="el" href="container__out_8hpp_source.html#l00143">inout::vectorlistprint()</a>.</p>

<p class="reference">Referenced by <a class="el" href="gaclustering__vktreebinary_8hpp_source.html#l00070">eac::gaclustering_vktreebinary()</a>.</p>
<div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="namespacegraph_a297cbabf753f01d6b237bec48484798e_cgraph.svg" width="306" height="155"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>

</div>
</div>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Apr 19 2019 08:58:35 for Library Evolutionary Algorithms for Clustering (LEAC) by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
